Aperiodic propagation criteria for Boolean functions

نویسندگان

  • Lars Eirik Danielsen
  • T. Aaron Gulliver
  • Matthew G. Parker
چکیده

We characterise the aperiodic autocorrelation for a Boolean function, f , and define the Aperiodic Propagation Criteria (APC) of degree l and order q. We establish the strong similarity between APC and the Extended Propagation Criteria (EPC) as defined by Preneel et al. in 1991, although the criteria are not identical. We also show how aperiodic autocorrelation can be related to the first derivative of f . We further propose the metric APC distance and show that quantum error correcting codes (QECCs) are natural candidates for Boolean functions with favourable APC distance.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Self-Dual Quantum Codes, Graphs, and Boolean Functions

A short introduction to quantum error correction is given, and it is shown that zero-dimensional quantum codes can be represented as self-dual additive codes over GF(4) and also as graphs. We show that graphs representing several such codes with high minimum distance can be described as nested regular graphs having minimum regular vertex degree and containing long cycles. Two graphs correspond ...

متن کامل

Nonlinearity and Propagation Characteristics of Balanced Boolean Functions

Three important criteria for cryptographically strong Boolean functions are balance, nonlinearity and the propagation criterion. The main contribution of this paper is to reveal a number of interesting properties of balance and nonlinearity, and to study systematic methods for constructing Boolean functions that satisfy some or all of the three criteria. We show that concatenating, splitting, m...

متن کامل

Nonlinearly Balanced Boolean Functions andTheir

Three of the most important criteria for cryptographically strong Boolean functions are the balancedness, the nonlinearity and the propagation criterion. This paper studies systematic methods for constructing Boolean functions satisfying some or all of the three criteria. We show that concatenating, splitting, modifying and multiplying sequences can yield balanced Boolean functions with a very ...

متن کامل

Nonlinearly Balanced Boolean Functions and Their Propagation Characteristics (Extended Abstract)

Three of the most important criteria for cryptographically strong Boolean functions are the balancedness the nonlinearity and the propagation criterion This paper studies systematic methods for con structing Boolean functions satisfying some or all of the three criteria We show that concatenating splitting modifying and multiplying se quences can yield balanced Boolean functions with a very hig...

متن کامل

Propagation Models and Fitting Them for the Boolean Random Sets

In order to study the relationship between random Boolean sets and some explanatory variables, this paper introduces a Propagation model. This model can be applied when corresponding Poisson process of the Boolean model is related to explanatory variables and the random grains are not affected by these variables. An approximation for the likelihood is used to find pseudo-maximum likelihood esti...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Inf. Comput.

دوره 204  شماره 

صفحات  -

تاریخ انتشار 2006